Search results for "Standard basis"
showing 9 items of 9 documents
Vectors and Vector Fields
2012
The purpose of this book is to explain in a rigorous way Stokes’s theorem and to facilitate the student’s use of this theorem in applications. Neither of these aims can be achieved without first agreeing on the notation and necessary background concepts of vector calculus, and therein lies the motivation for our introductory chapter.
Summing multi-norms defined by Orlicz spaces and symmetric sequence space
2016
We develop the notion of the \((X_1,X_2)\)-summing power-norm based on a~Banach space \(E\), where \(X_1\) and \(X_2\) are symmetric sequence spaces. We study the particular case when \(X_1\) and \(X_2\) are Orlicz spaces \(\ell_\Phi\) and \(\ell_\Psi\) respectively and analyze under which conditions the \((\Phi, \Psi)\)-summing power-norm becomes a~multinorm. In the case when \(E\) is also a~symmetric sequence space \(L\), we compute the precise value of \(\|(\delta_1,\cdots,\delta_n)\|_n^{(X_1,X_2)}\) where \((\delta_k)\) stands for the canonical basis of \(L\), extending known results for the \((p,q)\)-summing power-norm based on the space \(\ell_r\) which corresponds to \(X_1=\ell_p\), …
The route to high accuracy in ab initio calculations of Cu quadrupole-coupling constants.
2012
We report nonrelativistic and scalar-relativistic coupled-cluster calculations of the copper quadrupole-coupling constants for eleven small copper-containing compounds. It is shown to be necessary to treat both electron-correlation and scalar-relativistic effects on the same footing even for a qualitatively correct description, because both effects are significant and are strongly coupled in the case of Cu electric-field gradients. We show that the three scalar-relativistic schemes employed in the present study--the leading order of direct perturbation theory, the spin-free exact two-component theory in its one-electron variant, and the spin-free Dirac-Coulomb approach--provide accurate tre…
Nucleotide's bilinear indices: Novel bio-macromolecular descriptors for bioinformatics studies of nucleic acids. I. Prediction of paromomycin's affin…
2009
A new set of nucleotide-based bio-macromolecular descriptors are presented. This novel approach to bio-macromolecular design from a linear algebra point of view is relevant to nucleic acids quantitative structure-activity relationship (QSAR) studies. These bio-macromolecular indices are based on the calculus of bilinear maps on Re(n)[b(mk)(x (m),y (m)):Re(n) x Re(n)--Re] in canonical basis. Nucleic acid's bilinear indices are calculated from kth power of non-stochastic and stochastic nucleotide's graph-theoretic electronic-contact matrices, M(m)(k) and (s)M(m)(k), respectively. That is to say, the kth non-stochastic and stochastic nucleic acid's bilinear indices are calculated using M(m)(k)…
Principal part of multi-parameter displacement functions
2012
This paper deals with a perturbation problem from a period annulus, for an analytic Hamiltonian system [J.-P. Françoise, Ergodic Theory Dynam. Systems 16 (1996), no. 1, 87–96 ; L. Gavrilov, Ann. Fac. Sci. Toulouse Math. (6) 14(2005), no. 4, 663–682. The authors consider the planar polynomial multi-parameter deformations and determine the coefficients in the expansion of the displacement function generated on a transversal section to the period annulus. Their first result gives a generalization to the Françoise algorithm for a one-parameter family, following [J.-P. Françoise and M. Pelletier, J. Dyn. Control Syst. 12 (2006), no. 3, 357–369. The second result expresses the principal terms in …
Partial characters with respect to a normal subgroup
1999
AbstractSuppose that G is a π-separable group. Let N be a normal π1-subgroup of G and let H be a Hall π-subgroup of G. In this paper, we prove that there is a canonical basis of the complex space of the class functions of G which vanish of G-conjugates ofHN. When N = 1 and π is the complement of a prime p, these bases are the projective indecomposable characters and set of irreduciblt Brauer charcters of G.
Algebraic Treatment of a Three-Oscillator System: Applications to Some Molecular Models
1997
Abstract A new algebraic treatment of a three-oscillator system, called 3d formalism, is proposed. First, arbitrary tensor operators, expressed in terms of elementary creation and annihilation boson operators, are built within the standard algebraic chain u (3) ⊃ so (3) ⊃ so (2). Their matrix elements are next derived in a standard basis. Some applications, which require few adaptions or extensions, are proposed. They allow one to recover, for instance, Hecht's and tetrahedral Hamiltonians associated with threefold degenerate modes of spherical molecules and the vibron model Hamiltonian introduced for diatomic molecules.
Orientation of a Surface
2012
We know from Chap. 4 that in order to evaluate the flux of a vector field across a regular surface S, we need to choose a unit normal vector at each point of S in such a way that the resulting vector field is continuous. For instance, if we submerge a permeable sphere into a fluid and we select the field of unit normal outward vectors on the sphere, then the flux of the velocity field of the fluid across the sphere gives the amount of fluid leaving the sphere per unit time. However, if we select the field of unit normal inward vectors on the sphere, then the flux of the velocity field of the fluid across the sphere gives the amount of fluid entering the sphere per unit time (which is the ne…
OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS
2010
The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently, computing the representation of a multivariate polynomial in the tensorial Bernstein basis is an exponential time algorithm, which makes tensorial Bernstein-based solvers impractical for systems with more than n = 6 or 7 variables. This article describes a polytope (Bernstein polytope) with a number of faces, which allows to bound a sparse, multivariate polynomial expressed in the canonical basis by solving several linear programming problems. We compare the performance of a subdivision solver using domain reductions by linear programming with a solver using a c…